Non Homogeneous Rough Finite State Automaton
نویسندگان
چکیده
منابع مشابه
The Complexity of a Counting Finite-State Automaton
A counting finite-state automaton is a nondeterministic finite-state automaton which, on an input over its input alphabet, (magically) writes in binary the number of accepting computations on the input. We examine the complexity of computing the counting function of an NFA, and the complexity of recognizing its range as a set of binary strings. We also consider the pumping behavior of counting ...
متن کاملLearning Diagnosis Based on Evolving Fuzzy Finite State Automaton
Nowadays, determining faults (or critical situations) in nonstationary environment is a challenging task in complex systems such as Nuclear center, or multi-collaboration such as crisis management. A discrete event system or a fuzzy discrete event system approach with a fuzzy role-base may resolve the ambiguity in a fault diagnosis problem especially in the case of multiple faults (or multiple ...
متن کامل1 the Complexity of a Counting Finite - State Automaton
A counting finite-state automaton is a nondeterministic finite-state automaton which, on an input over its input alphabet, (magically) writes in binary the number of accepting computations on the input. We examine the complexity of computing the counting function of an NFA, and the complexity of recognizing its range as a set of binary strings. We also consider the pumping behavior of counting ...
متن کاملDoes a Rock Implement Every Finite-State Automaton?
Putnam has argued that computational functionalism cannot serve as a foundation for the study of the mind, as every ordinary open physical system implements every finite-state automaton. I argue that Putnam’s argument fails, but that it points out the need for a better understanding of the bridge between the theory of computation and the theory of physical systems: the relation of implementatio...
متن کاملA finite state automaton model for multi-neuron simulations
‘Classical’ compartmental modelling techniques involve numerical solution of large sets of ordinary differential equations (ODEs). The computational cost of neuronal network evaluation using these techniques forms a major bottleneck in the exploration of the effects of dendrite morphology on network functionality. To reduce computational load, we have developed a finite state automaton model of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Revista Gestão Inovação e Tecnologias
سال: 2021
ISSN: 2237-0722,2237-0722
DOI: 10.47059/revistageintec.v11i2.1700